Robust Balancing in B-Trees
نویسندگان
چکیده
Robust balancing is a technique for maintaining generalized B-trees with a cumulative rebalancing cost that is asymptotically linear. It is especially significant in conjunction with fingers, which can make cumulative search cost linear. We define a new family of robust balancing algorithms which includes algorithms with sublinear rebalancing cost, extending previous work that has shown linear algorithms. An accounting technique is developed which gives strong bounds on rebalancing cost. We also consider robust balancing for B*-trees, a B-tree variant with improved space utilization.
منابع مشابه
Multi-objective scheduling and assembly line balancing with resource constraint and cost uncertainty: A “box” set robust optimization
Assembly lines are flow-oriented production systems that are of great importance in the industrial production of standard, high-volume products and even more recently, they have become commonplace in producing low-volume custom products. The main goal of designers of these lines is to increase the efficiency of the system and therefore, the assembly line balancing to achieve an optimal system i...
متن کاملDesign Patterns for Self-Balancing Trees
Lists and trees are standard topics in a computer science curriculum. In many applications, they are used to implement containers whose main behaviors consist of storage, retrieval and removal of data objects. Various forms of self-balancing trees (SBTs) such as B-trees guarantee a O(logN) efficiency for these computations. Current textbooks on this subject (see for example [2]) discuss them in...
متن کاملS(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generalize traditional B-trees. Contrary to B-trees S(b)-trees provide optimal utilization of keys of variable length, while the data access time remains logarithmical, the same as for B-trees. The main property of the new tree...
متن کاملRelaxed Balanced Red-Black Trees
Relaxed balancing means that, in a dictionary stored as a balanced tree, the necessary rebalancing after updates may be delayed. This is in contrast to strict balancing meaning that rebalancing is performed immediately after the update. Relaxed balancing is important for efficiency in highly dynamic applications where updates can occur in bursts. The rebalancing tasks can be performed gradually...
متن کاملVerifying Balanced Trees
Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability comes at a price; balanced trees are more complex than their unbalanced counterparts both in terms of data structure themselves and related manipulation operations. In this paper we present a framework to model balanced trees in ...
متن کامل